منابع مشابه
Combinatorial Necklace Splitting
We give a new, combinatorial proof for the necklace splitting problem for two thieves using only Tucker's lemma (a combinatorial version of the Borsuk-Ulam theorem). We show how this method can be applied to obtain a related recent result of Simonyi and even generalize it. 1 Necklace Splitting This paper was inspired by the combinatorial proof of Matou2ek [7] of the Lovász-Kneser theorem [6]. H...
متن کاملSimplotopal maps and necklace splitting
We show how to prove combinatorially the Splitting Necklace Theorem by Alon for any number of thieves. Such a proof requires developing a combinatorial theory for abstract simplotopal complexes and simplotopal maps, which generalizes the theory of abstract simplicial complexes and abstract simplicial maps. Notions like orientation, subdivision, and chain maps are defined combinatorially, withou...
متن کاملPaintshop, odd cycles and necklace splitting
The following problem is well-known under various forms from car manufacturing and has been presented in Discrete Applied Mathematics(136) by T.Epping, W.Hochstättler and P.Oertel as a combinatorial optimization problem: cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color ...
متن کاملPrivacy-preserving Data Splitting: A Combinatorial Approach
Privacy-preserving data splitting is a technique that aims to protect data privacy by storing different fragments of data in different locations. In this work we give a new combinatorial formulation to the data splitting problem. We see the data splitting problem as a purely combinatorial problem, in which we have to split data attributes into different fragments in a way that satisfies certain...
متن کاملCombinatorial Aspects of the Splitting Number
This paper deals with the splitting number s and polarized partition relations. In the first section we define the notion of strong splitting families, and prove that its existence is equivalent to the failure of the polarized relation `
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/168